Powerset construction
METHOD FOR CONVERTING A NONDETERMINISTIC FINITE AUTOMATON INTO A DETERMINISTIC ONE
Power set construction; Nondeterministic finite state machine/Proofs; NDFA to DFA conversion algorithm; Subset construction; Determinization of Automaton; Determinization; Determinization of automaton; Determinization of automata; Rabin-Scott powerset construction; Subset construction algorithm; NFA to DFA conversion; NFA to DFA Conversion
In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language. It is important in theory because it establishes that NFAs, despite their additional flexibility, are unable to recognize any language that cannot be recognized by some DFA.